The State Complexity of Star-Complement-Star
نویسندگان
چکیده
We resolve an open question by determining matching (asymptotic) upper and lower bounds on the state complexity of the operation that sends a language L to (
منابع مشابه
Syntactic Complexity of Star-Free Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, taken as a function of the state complexity of these languages. We study the syntactic complexity of star-free regular languages, that is, languages that can be constructed fro...
متن کاملSpin and Isospin Asymmetry, Equation of State and Neutron Stars
In the present work, we have obtained the equation of state for neutron star matter considering the in uence of the ferromagnetic and antiferromagnetic spin state. We have also investigated the structure of neutron stars. According to our results, the spin asymmetry stiens the equation of state and leads to high mass for the neutron star.
متن کاملScaling relations in dynamical evolution of star clusters
We have carried out a series of small scale collisional N-body calculations of single-mass star clusters to investigate the dependence of the lifetime of star clusters on their initial parameters. Our models move through an external galaxy potential with a logarithmic density profile and they are limited by a cut-off radius. In order to find scaling relations between the lifetime of star cluste...
متن کاملمحاسبه اثر نوترینو در محاسبه ساختار ستاره نوترونی تازه متولد شده
In this paper, we consider the first case of formation of newborn neutron star named protoneutron star which is described with constant entropy per baryon about 1-2kB ( kB is Boltzman constant ) and lepton fraction about 0.3-0.4. In this case, by considering the neutrinos mean energy in our calculations, we compute the total energy, equation of state, mass and radius of protoneutron star. Fin...
متن کاملTwo-stage stochastic programming model for capacitated complete star p-hub network with different fare classes of customers
In this paper, a stochastic programming approach is applied to the airline network revenue management problem. The airline network with the arc capacitated single hub location problem based on complete–star p-hub network is considered. We try to maximize the profit of the transportation company by choosing the best hub locations and network topology, applying revenue management techniques to al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012